A stochastic programming approach to surgery scheduling under parallel processing principle

• We schedule surgeries for surgical suites that follow parallel processing principle Parallel refers to the concurrent implementation of induction and turnover propose a two-stage stochastic mixed-integer programming model implement novel progressive hedging algorithm solve compare serial systems based on waiting time resource utilization is which enables simultaneous anesthesia operating room (OR) with aim improving OR utilization. In this article, we study problem scheduling multiple ORs rooms (IR) function under uncertainty. considering uncertainty in induction, surgery durations. sequence patients set appointment times first stage assign IRs at second model. show an optimal myopic policy can be used IR assignment decisions due special structure minimize expected total cost patient time, idle objective function. enhance formulation using bounds variables symmetry-breaking constraints. by proposing penalty update method variable fixing mechanism. Based real data large academic hospital, our solution approach several heuristics from literature. assess additional benefits costs associated near-optimal schedules. examine how are inflated increasing number IRs. Finally, estimate value underline importance